Interactive all-hex meshing via cuboid decomposition

نویسندگان

چکیده

Standard PolyCube-based hexahedral (hex) meshing methods aim to deform the input domain into an axis-aligned PolyCube volume with integer corners; if this deformation is bijective, then applying inverse map voxelized yields a valid hex mesh. A key challenge in these maintain bijectivity of deformation, thus reducing robustness algorithms. In work, we present interactive pipeline for that sidesteps by using new representation PolyCubes as unions cuboids. We begin deforming tetrahedral mesh near-PolyCube whose faces are loosely aligned major axis directions. build optimizing layout set cuboids user guidance closely fit deformed domain. Finally, construct inversion-free pullback from while quality metrics. allow extensive control over each stage, such editing PolyCube, positioning surface vertices, and exploring trade-off among competing metrics, also providing automatic alternatives. validate our method on one hundred shapes, including models challenging past frame-field-based methods. Our reliably produces meshes par or better than state-of-the-art. additionally conduct study 21 participants which majority prefer they make tool ones state-of-the-art This demonstrates need intuitive tools where can dictate priorities their

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

All-Hex Meshing of Multiple-Region Domains without Cleanup.

In this paper, we present a new algorithm for all-hex meshing of domains with multiple regions without post-processing cleanup. Our method starts with a strongly balanced octree. In contrast to snapping the grid points onto the geometric boundaries, we move points a slight distance away from the common boundaries. Then we intersect the moved grid with the geometry. This allows us to avoid creat...

متن کامل

Dupin Meshing: A Parameterization Approach to Planar Hex-Dominant Meshing

Planar hexagonal-dominant (PHex) meshes are an important class of meshes with minimal vertex-degree. They are highly useful in the rationalization of freeform architectural surfaces, for construction with flat steel, glass, or wooden panels of equal thickness. A PHex mesh must contain both convex and concave faces of varying anisotropic shapes due to the planarity constraint. Therefore, while p...

متن کامل

Parallel Hex Meshing from Volume Fractions

In this work, we introduce a new method for generating Lagrangian computational meshes from Eulerian-based data. We focus specifically on shock physics problems that are relevant to Eulerian-based codes that generate volume fraction data on a Cartesian grid. A step-by-step procedure for generating an allhexahedral mesh is presented. We focus specifically on the challenges of developing a parall...

متن کامل

Automatic scheme selection for toolkit hex meshing

Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50 per cent of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that the...

متن کامل

An All-Hex Meshing Strategy for Bifurcation Geometries in Vascular Flow Simulation

We develop an automated all-hex meshing strategy for bifurcation geometries arising in subject-specific computational hemodynamics modeling. The key components of our approach are the use of a natural coordinate system, derived from solutions to Laplace’s equation, that follows the tubular vessels (arteries, veins, or grafts) and the use of a tripartitioned-based mesh topology that leads to bal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Graphics

سال: 2021

ISSN: ['0730-0301', '1557-7368']

DOI: https://doi.org/10.1145/3478513.3480568